Performance Isolation and Fairness for Multi-Tenant Cloud Storage
نویسندگان
چکیده
Shared storage services enjoy wide adoption in commercial clouds. But most systems today provide weak performance isolation and fairness between tenants, if at all. Misbehaving or high-demand tenants can overload the shared service and disrupt other well-behaved tenants, leading to unpredictable performance and violating SLAs. This paper presents Pisces, a system for achieving datacenter-wide per-tenant performance isolation and fairness in shared key-value storage. Today’s approaches for multi-tenant resource allocation are based either on perVM allocations or hard rate limits that assume uniform workloads to achieve high utilization. Pisces achieves per-tenant weighted fair shares (or minimal rates) of the aggregate resources of the shared service, even when different tenants’ partitions are co-located and when demand for different partitions is skewed, time-varying, or bottlenecked by different server resources. Pisces does so by decomposing the fair sharing problem into a combination of four complementary mechanisms—partition placement, weight allocation, replica selection, and weighted fair queuing—that operate on different time-scales and combine to provide system-wide max-min fairness. An evaluation of our Pisces storage prototype achieves nearly ideal (0.99 Min-Max Ratio) weighted fair sharing, strong performance isolation, and robustness to skew and shifts in tenant demand. These properties are achieved with minimal overhead (<3%), even when running at high utilization (more than 400,000 requests/second/server for 10B requests).
منابع مشابه
Towards Fair Sharing of Block Storage in a Multi-tenant Cloud
A common problem with disk-based cloud storage services is that performance can vary greatly and become highly unpredictable in a multi-tenant environment. A fundamental reason is the interference between workloads co-located on the same physical disk. We observe that different IO patterns interfere with each other significantly, which makes the performance of different types of workloads unpre...
متن کاملHUG: Multi-Resource Fairness for Correlated and Elastic Demands
In this paper, we study how to optimally provide isolation guarantees in multi-resource environments, such as public clouds, where a tenant’s demands on different resources (links) are correlated. Unlike prior work such as Dominant Resource Fairness (DRF) that assumes static and fixed demands, we consider elastic demands. Our approach generalizes canonical max-min fairness to the multi-resource...
متن کاملCPU Sharing Techniques for Performance Isolation in Multitenant Relational Database-as-a-Service
Multi-tenancy and resource sharing are essential to make a Databaseas-a-Service (DaaS) cost-effective. However, one major consequence of resource sharing is that the performance of one tenant’s workload can be significantly affected by the resource demands of co-located tenants. The lack of performance isolation in a shared environment can make DaaS less attractive to performance-sensitive tena...
متن کاملAdvanced Cache Techniques for SLA-Driven Multi-Tenant Application on PaaS
Multi-tenant application is one of the main characteristics of cloud computing. Today, most of the application uses cache service for getting faster access and low response time. Currently in multi-tenant cloud applications data are often evicted mistakenly by cache service, which is managed by existing algorithms such as LRU. Also, security mechanisms are implemented to avoid data breach when ...
متن کاملSeawall: Performance Isolation for Cloud Datacenter Networks
While today’s virtual datacenters have hypervisor based mechanisms to partition compute resources between the tenants co-located on an end host, they provide little control over how tenants share the network. is opens cloud applications to interference from other tenants, resulting in unpredictable performance and exposure to denial of service attacks. is paper explores the design space for a...
متن کامل